Security Verification of an Authentication Algorithm Based on Verifiable Encryption

A new class of cryptosystems called verifiable encryption (VE) that facilitates the verification two plaintexts without decryption was proposed in our previous paper. The main contributions study include following. (1) Certain such as one-time pad belong to VE class. (2) We constructed an authentication algorithm for unlocking local devices via a network utilizes property VE. (3) As result implementing VE-based using pad, encryption, verification, and processing times are less than 1 ms even with text length 8192 bits. All personal information used is protected by Shanon’s perfect secrecy. (4) robustness against man-in-the-middle attacks plaintext discussed. However, discussion about security insufficient from following perspectives: (A) its other theoretical ciphertext-only, known-plaintext, chosen-plaintext, adaptive chosen-ciphertext, chosen-ciphertext not discussed; (B) formal analysis tools performed. In this paper, we analyze discussing above validating tool. These analyses, show known ineffective algorithm.